The Mutual Exclusion Problem for Unreliable Processes: Preliminary Report
نویسندگان
چکیده
All coordination between processes is to .be accomplished by means of the execution. 6.f. "the primitive operations of a process (ll reading another process's spedalvariable, and .(2)' seUing .its own spedal variable to ·some. value. A process may "die" at any time,. when its spedal variable is (automatically) set to a special "dead" value. A dead process may revive.. Reading a special variable which is being simultaneously written returns either the old or the new value.
منابع مشابه
An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملMyths About the Mutual Exclusion Problem
Recently in these pages appeared a report by Doran and Thomas [2] which gave partially simplified versions of Dekker-like solutions to the two process mutual exclusion problem with busy-waiting. This report presents a truly simple solution to the problem and attempts in a small way to dispel some myths that seem to have arisen concerning the problem. Briefly, the mutual exclusion problem for tw...
متن کاملTechnical Report: KSU-CIS-TR-2011-2 MUTUAL EXCLUSION IN CYBER-PHYSICAL SYSTEMS
Distributed computing problems such as mutual exclusion have been studied extensively for traditional distributed systems. In traditional systems, a strict layered approach is taken wherein a set of users (application processes) U1, . . . ,Un is layered on top of a mutual exclusion algorithm with processes P1, . . . ,Pn. User Ui interacts with process Pi to request access to resources which are...
متن کاملThe Message Passing Group Mutual Exclusion: A Review
The group mutual exclusion (GME) problem is an interesting generalization of the mutual exclusion problem. The group mutual exclusion problem deals with two contradictory issues of mutual exclusion and concurrency. The purpose is to allow concurrent access to the processes requesting for the same resource. However, the processes requesting for different resources must access requested resources...
متن کاملA Delay-Optimal Group Mutual Exclusion Algorithm for a Tree Network
The group mutual exclusion problem is an extension of the traditional mutual exclusion problem in which every critical section is associated with a type or a group. Processes requesting critical sections of the same type can execute their critical sections concurrently. However, processes requesting critical sections of different types must execute their critical sections in a mutually exclusiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1976